Ki-covers I: Complexity and polytopes
نویسندگان
چکیده
منابع مشابه
Finite polytopes have finite regular covers
We prove that any finite, abstract n-polytope is covered by a finite, abstract regular n-polytope.
متن کاملUnimodular Covers of Multiples of Polytopes
Let P be a d-dimensional lattice polytope. We show that there exists a natural number cd , only depending on d, such that the multiples cP have a unimodular cover for every c ∈ N, c ≥ cd . Actually, an explicit upper bound for cd is provided, together with an analogous result for unimodular covers of rational cones. 1. STATEMENT OF RESULTS All polytopes and cones considered in this paper are as...
متن کاملGeometry, Complexity, and Combinatorics of Permutation Polytopes
Each group G of permutation matrices gives rise to a permutation polytope P(G) = cony(G) c Re×d, and for any x ~ W, an orbit polytope P(G, x) = conv(G, x). A broad subclass is formed by the Young permutation polytopes, which correspond bijectively to partitions 2 = (21, ..., 2k)~-n of positive integers, and arise from the Young representations of the symmetric group. Young polytopes provide a f...
متن کاملAlcoved Polytopes, I
The aim of this paper is to initiate the study of alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hyper-simplices. We compare two constructions of triangulations of hypersimplices due to Stanley and Sturmfels and explain them in terms of alcoved polytopes. We study triangulations ...
متن کاملComplexity of Finding Nearest Colorful Polytopes
Let P1, . . . , Pd+1 ⊂ R be point sets whose convex hulls each contain the origin. Each set represents a color class. The Colorful Carathéodory theorem guarantees the existence of a colorful choice, i.e., a set that contains exactly one point from each color class, whose convex hull also contains the origin. The computational complexity of finding such a colorful choice is still unknown. We stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90156-1